LU Factorization of Non-standard Forms and Direct Multiresolution Solvers
نویسندگان
چکیده
منابع مشابه
LU Factorization of Non-standard Forms and Direct Multiresolution Solvers
In this paper we introduce the multiresolution LU factorization of non-standard forms (NS-forms) and develop fast direct multiresolution methods for solving systems of linear algebraic equations arising in elliptic problems. The NS-form has been shown to provide a sparse representation for a wide class of operators, including those arising in strictly elliptic problems. For example, Green’s fun...
متن کاملA Comparison of Pivoting Strategies for the Direct LU Factorization
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usual Gaussian elimination and show that two so-called total scaled and total pivoting strategies can be employed in addition to the traditional pivoting strategies: partial scaled, partial, and direct diagonal. In this paper we o er a general LU factorization with total scaled pivoting algorithm fr...
متن کاملParallelizing LU Factorization
Systems of linear equations can be represented by matrix equations of the form A~x = ~b. LU Factorization is a method for solving systems in this form by transforming the matrix A into a form that makes backwards and forward susbstitution feasible. A common algorithm for LU factorization is Gaussian elimination, which I used for my serial and parallel implementations. I investigated using async...
متن کاملMixing LU and QR factorization algorithms to design high-performance dense linear algebra solvers
This paper introduces hybrid LU–QR algorithms for solving dense linear systems of the form Ax = b. Throughout a matrix factorization, these algorithms dynamically alternate LU with local pivoting and QR elimination steps based upon some robustness criterion. LU elimination steps can be very efficiently parallelized, and are twice as cheap in terms of floating-point operations, as QR steps. Howe...
متن کاملBlock LU Factorization
Many of the currently popular \block algorithms" are scalar algorithms in which the operations have been grouped and reordered into matrix operations. One genuine block algorithm in practical use is block LU factorization, and this has recently been shown by Demmel and Higham to be unstable in general. It is shown here that block LU factorization is stable if A is block diagonally dominant by c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 1998
ISSN: 1063-5203
DOI: 10.1006/acha.1997.0227